Small intersection numbers in the curve graph
نویسندگان
چکیده
منابع مشابه
Intersection numbers in the curve graph with a uniform constant
We derive various inequalities involving the intersection number of the curves contained in geodesics and tight geodesics in the curve graph. While there already exist such inequalities on tight geodesics, our method applies in the setting of geodesics. Furthermore, the method gives inequalities with a uniform constant depending only on the topology of the surface.
متن کاملThe small intersection graph relative to multiplication modules
Let $R$ be a commutative ring and let $M$ be an $R$-module. We define the small intersection graph $G(M)$ of $M$ with all non-small proper submodules of $M$ as vertices and two distinct vertices $N, K$ are adjacent if and only if $Ncap K$ is a non-small submodule of $M$. In this article, we investigate the interplay between the graph-theoretic properties of $G(M)$ and algebraic properties of $M...
متن کاملthe small intersection graph relative to multiplication modules
let $r$ be a commutative ring and let $m$ be an $r$-module. we define the small intersection graph $g(m)$ of $m$ with all non-small proper submodules of $m$ as vertices and two distinct vertices $n, k$ are adjacent if and only if $ncap k$ is a non-small submodule of $m$. in this article, we investigate the interplay between the graph-theoretic properties of $g(m)$ and algebraic properties of $m...
متن کاملIntersection numbers and the hyperbolicity of the curve complex
In [MM1], Masur and Minsky showed that the curve complex associated to a surface is hyperbolic in the sense of Gromov. In this paper we give another proof of this result. Our constructions are more combinatorial in nature, and allow for certain refinements and elaborations. The result applies to a compact surface, possibly with boundary (apart from a few trivial cases), or equivalently to a clo...
متن کاملThe vertex and edge graph reconstruction numbers of small graphs
First posed in 1942 by Kelly and Ulam, the Graph Reconstruction Conjecture is one of the major open problem in graph theory. While the Graph Reconstruction Conjecture remains open, it has spawned a number of related questions. In the classical vertex graph reconstruction number problem a vertex is deleted in every possible way from a graph G, and then it can be asked how many (both minimum and ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Bulletin of the London Mathematical Society
سال: 2014
ISSN: 0024-6093
DOI: 10.1112/blms/bdu057